Montgomery Modular Multiplication Algorithm for Multi-Core Systems
نویسندگان
چکیده
This paper presents an efficient software implementation of the Montgomery modular multiplication algorithm on a multi-core system. A prototype of general multi-core systems is designed with GEZEL. We propose a new instruction scheduling method for multi-core systems that can reduce the number of data transfers between different cores. Compared to the implementations on a single-core system, the performance can be improved by a factor of 1.87 and 3.68 when 256-bit modular multiplication being performed on a 2-core and 4-core system, respectively.
منابع مشابه
Highly-Parallel Montgomery Multiplication for Multi-Core General-Purpose Microprocessors
Popular public key algorithms such as RSA and Di e-Hellman key exchange, and more advanced cryptographic schemes such as Paillier's and Damgård-Jurik's algorithms (with applications in private information retrieval), require e cient modular multiplication with large integers of size at least 1024 bits. Montgomery multiplication algorithm has proven successful for modular multiplication of large...
متن کاملFPGA Implementation of Modular Exponentiation for RSA Cryptosystem
In this paper, the implementation of RSA (Rivest, Shamir and Adleman) cryptosystem using Hardware/Software (HW/SW) co-design approach is presented. The main function of RSA is the Modular Exponentiation (ME) which is accomplished by repeated Modular Multiplications (MM’s) on large integers. In this work, we propose the implementation of the ME as a Programmable System on Chip (PSoC), using the ...
متن کاملPerformance Analysis of Montgomery Multiplication Algorithm for Multi-core Systems Using Concurrent Java
The Requirement of information security on topology network has become more important. Cryptography is a method to provide information confidentiality, authenticity and integrity. There are so many challenges to implement a public key cryptography algorithm such as execution time, time consuming, time cost, integrated methods, memory Requirement in public key cryptography. In parallel computati...
متن کاملSystolic Hardware Implementation for the Montgomery Modular Multiplication
Modular multiplication is a cornerstone computation in public-key cryptography systems such as RSA cryptosystem. The operation is time consuming for large operands. This paper describes the characteristics of a systolic array-based architecture to implement modular multiplication using the fast Montgomery algorithm. The paper evaluates the prototype using the time×area classic factor. Key-Words...
متن کاملMulti-core FPGA Implementation of ECC with Homogeneous Co-Z Coordinate Representation
Elliptic Curve Cryptography (ECC) is gaining popularity in recent years. Having short keys and short signatures in particular makes ECC likely to be adopted in numerous internet-of-things (IoT) devices. It is therefore critical to optimize ECC well for both speed and power consumption. Optimization opportunities exist on several different levels: algorithm, architecture, and/or implementation. ...
متن کامل